Design of a Fractional Pseudo-Chaotic Random Number Generator
نویسندگان
چکیده
منابع مشابه
A Pseudo Random Number Generator Based on Chaotic Billiards
The systems of chaotic billiards revealed a well developed chaotic behavior. Despite its good characteristics, these systems have not yet been applied to the cryptography; among the reasons is the difficulty of expressing the equation of particle motion in an explicit form. In this work, we took advantage the properties offered by the random walks and unpredictability of two particles moving in...
متن کاملSustainable Pseudo-random Number Generator
Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or partial controls of the generators’ entropy resources. The BH scheme is constructed from the Barak, Shaltiel and Tromer’s randomness extractor and its security is formalized in the simulation-based framework. The BH model ...
متن کاملDesign and Evaluation of Hardware Pseudo-Random Number Generator MT19937
MT19937 is a kind of Mersenne Twister, which is a pseudo-random number generator. This study presents new designs for a MT19937 circuit suitable for custom computing machinery for highperformance scientific simulations. Our designs can generate multiple random numbers per cycle (multi-port design). The estimated throughput of a 52-port design was 262Gbps, which is 115 times higher than the soft...
متن کاملA Simple Unpredictable Pseudo-Random Number Generator
Two closely-related pseudo-random sequence generators are presented: The lIP generator, with input P a prime, outputs the quotient digits obtained on dividing by P. The x mod N generator with inputs N, Xo (where N P. Q is a product of distinct primes, each congruent to 3 mod 4, and x0 is a quadratic residue mod N), outputs bob1 b2" where bi parity (xi) and xi+ x mod N. From short seeds each gen...
متن کاملA practical “perfect” pseudo-random number generator
The “x2 mod N” generator, also known as the BBS generator [2], has a strong theoretical foundation from the computational complexity theory and the number theory. Proofs were given that, under certain reasonable assumptions on which modern cryptography heavily relies, the BBS pseudo-random sequences would pass any feasible statistical test. Unfortunately, the algorithm was found to be too slow ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Chaotic Computing
سال: 2020
ISSN: 2046-3359
DOI: 10.20533/ijcc.2046.3359.2020.0022